Execution method, execution device, learning method, learning device, and recording medium for deep neural network

ABSTRACT

Executing a deep neural network by obtaining, during deep neural network inference, a binary intermediate feature map in binary representation by converting a floating-point or fixed-point intermediate feature map into a binary vector using a first transformation module; generating a compressed feature map by compressing the binary intermediate feature map using a nonlinear dimensionality reduction layer; storing the compressed feature map into memory; reconstructing the binary intermediate feature map by decompressing the compressed feature map read from the memory using a reconstruction layer corresponding to the nonlinear dimensionality reduction layer; and converting the reconstructed binary intermediate feature map into a floating-point or fixed-point intermediate feature map using a second transformation module.

CROSS REFERENCE TO RELATED APPLICATIONS

This is a continuation application of PCT International Application No. PCT/US2018/048867 filed on Aug. 30, 2018, designating the United States of America, which is based on and claims priority of U.S. Provisional Patent Application No. 62/554,224 filed on Sep. 5, 2017. The entire disclosures of the above-identified applications, including the specifications, drawings and claims are incorporated herein by reference in their entirety.

FIELD

The present disclosure relates to, for example, an execution method for a deep neural network.

BACKGROUND

Recent achievements of deep neural networks (hereinafter referred to as DNN) make them an attractive choice in many computer vision applications including image classification and object detection. However, the memory and computations required for DNNs can place an excessive processing load on low-power deployments.

Proposed or suggested methods of reducing such processing load include layer fusion in which calculation of layers can be fused without storing intermediate feature maps into memory, and compression of quantized feature map values using nonlinear dimensionality reduction layers (see Non Patent Literature (NPL) 1 and 2).

CITATION LIST Non Patent Literature

[NPL 1] M. Alwani, H. Chen, M. Ferdman, and P. A. Milder; Fused-layer CNN accelerators; MICRO; pages 1-12; October 2016

[NPL 2] F. N. Iandola, S. Han, M. W. Moskewicz, K. Ashraf, W. J. Daily, and K. Keutzer; Squeezenet: Alexnet-level accuracy with 50× fewer parameters and <0.5 MB model size; arXiv preprint arXiv:1602.07360, 2016

SUMMARY Technical Problem

However, the reductions in DNN processing load gained by the above methods are small and may introduce a reduction in accuracy. Furthermore, the improvement in processing speed is insufficient.

The present disclosure provides, for example, an execution method and execution device characterized by a low processing load and fast processing with a reduced drop in accuracy.

Solution to Problem

In order to solve the above problem, an execution method for a DNN according to one aspect of the present disclosure includes: obtaining, during deep neural network inference, a binary intermediate feature map in binary representation by converting a floating-point or fixed-point intermediate feature map into a binary vector using a first transformation module; generating a compressed feature map by compressing the binary intermediate feature map using a nonlinear dimensionality reduction layer; storing the compressed feature map into memory; reconstructing the binary intermediate feature map by decompressing the compressed feature map read from the memory using a reconstruction layer corresponding to the nonlinear dimensionality reduction layer; and converting the reconstructed binary intermediate feature map into a floating-point or fixed-point intermediate feature map using a second transformation module.

These general and specific aspects may be implemented using a system, a device, an integrated circuit, a computer program, a computer-readable recording medium (e.g. CD-ROM), or any combination of systems, devices, integrated circuits, computer programs, or computer-readable recording media.

Additional benefits and advantages of the disclosed embodiments will be apparent from the Specification and Drawings. The benefits and/or advantages may be individually obtained by the various embodiments and features of the Specification and Drawings, which need not all be provided in order to obtain one or more of such benefits and/or advantages.

Advantageous Effects

The DNN execution method, etc., according to the present disclosure are characterized by a low processing load and fast processing with a reduced drop in accuracy.

BRIEF DESCRIPTION OF DRAWINGS

These and other advantages and features will become apparent from the following description thereof taken in conjunction with the accompanying Drawings, by way of non-limiting examples of embodiments disclosed herein.

FIG. 1 shows a model illustrating a method according to an embodiment of executing a DNN during inference.

FIG. 2 is a model illustrating a forward pass during inference.

FIG. 3 is a model illustrating a backward pass during backpropagation corresponding to the execution method.

FIG. 4 shows the results of inference accuracies from an ImageNet dataset when the execution method is applied to SqueezeNet architecture in Implementation Example 1.

FIG. 5 shows the results of inference accuracies from an ImageNet dataset when the execution method is applied to MobileNetV2 architecture in Implementation Example 1.

FIG. 6 shows the results of inference accuracies from a VOC2007 dataset when the execution method is applied to an SSD512 model in Implementation Example 2.

FIG. 7 illustrates memory usage in SSD512 models in Implementation Example 2.

FIG. 8 is a block diagram illustrating a hardware configuration example of an information processing device that executes one of the above methods.

DESCRIPTION OF EMBODIMENTS

An execution method for a DNN according to one aspect of the present disclosure includes: obtaining, during deep neural network inference, a binary intermediate feature map in binary representation by converting a floating-point or fixed-point intermediate feature map into a binary vector using a first transformation module; generating a compressed feature map by compressing the binary intermediate feature map using a nonlinear dimensionality reduction layer; storing the compressed feature map into memory; reconstructing the binary intermediate feature map by decompressing the compressed feature map read from the memory using a reconstruction layer corresponding to the nonlinear dimensionality reduction layer; and converting the reconstructed binary intermediate feature map into a floating-point or fixed-point intermediate feature map using a second transformation module.

With this, compared to conventional art, it is possible to execute DNNs with little memory usage. This reduction in memory bandwidth leads to an increase in processing speeds.

Here, for example, the nonlinear dimensionality reduction layer may b a single projection convolved layer or a sequence of projection convolved layers, and the reconstruction layer may be a single reconstruction convolved layer or a sequence of reconstruction convolved layers.

A backpropagation-based learning method for the deep neural network executed using the above execution method, includes: applying an analytical derivative of the first transformation module and the second transformation module to a gradient for a next layer among layers included in the deep neural network to generate a gradient for a previous layer among the layers included in the deep neural network; updating a weight and a bias based on the gradient generated for the previous layer; and initializing a weight for the nonlinear dimensionality reduction layer and a weight for the reconstruction layer, based on an identity mapping function.

The addition of processing for binary representation in inference makes learning possible at the binary level. This allows DNNs to be executed with less memory usage and faster processing speeds than conventional art.

These general and specific aspects may be implemented using a system, a device, an integrated circuit, a computer program, a computer-readable recording medium (e.g. CD-ROM), or any combination of systems, devices, integrated circuits, computer programs, or computer-readable recording media.

Hereinafter, an exemplary embodiment is described in detail with reference to the Drawings.

The exemplary embodiment described below shows a general or specific example. The numerical values, shapes, materials, elements, the arrangement and connection of the elements, steps, the processing order of the steps etc. shown in the following exemplary embodiment are mere examples, and therefore do not limit the scope of the appended Claims and their equivalents. Therefore, among the elements in the following exemplary embodiment, those not recited in any one of the independent claims are described as optional elements.

Embodiment [DNN]

First, a commonly used DNN will be described.

The input feature map X^(l−1) of an l-th convolution layer in commonly used DNNs can be represented by (1), where Ć, H, and W are the number of input channels, the height and the width, respectively.

represents all real numbers.

X ^(l−1)∈

^(Ć×H×W)  (1)

The input X^(l−1) is convolved with a weight tensor W^(l) represented by (2), where C is the number of output channels, H_(f) and W_(f) are the height and the width of filter kernel, respectively.

W ^(l)∈

^(C×Ć×H) ^(f) ^(×W) ^(f)   (2)

Note that the bias vector b represented by (3) is added to the result of convolution operation.

b∈

^(C)  (3)

Once all C channels are computed, an element-wise nonlinear function is applied to the result of the convolution operations. Then, the C-th channel of the output tensor X^(l) represented by (4) can be computed using the computational expression represented by (5).

X ^(l)∈

^(C×H×W)  (4)

X ^(l) _(c) =g(W ^(l) _(c) *X ^(l−1) +b _(c))  (5)

Note that * in (5) denotes convolution operation, and g( ) is some nonlinear function. For example, assume g( ) is a rectified linear unit (ReLU) defined as g(x)=max(0,x) such that all activations are non-negative.

Please reference the above as needed for comprehension of denotations used in the figures and the following description.

[DNN Execution Method]

Next, a method according to this embodiment for executing a DNN during inference will be described. FIG. 1 shows a model that illustrates a DNN execution method according to this embodiment. In FIG. 1, the model indicated by (a) is a conventional method, and the model indicated by (b) is a method according to this embodiment. The two models are contrasted for comparative purposes.

The models indicated by (a) and (b) schematically illustrate neural networks including multiple convolution layers and processed from left to right. Note that to simplify notification, biases are not shown in either of the models.

First, with the conventional method indicated by (a), the calculation of N sequential layers is fused together (step S100) without storing intermediate feature maps X^(l−N+1) through X^(l−1) to obtain feature map X^(l). This fusion can be done in a channel-wise fashion using memory buffers which are much smaller than the whole feature map.

Next, feature map X^(l) is quantized using a nonlinear function q( ) (step S110). Pre-quantization feature map X^(l) is an element of a field of real numbers

, and quantized feature map {circumflex over (x)}^(l) is an element of a finite field over integers. The quantization step may introduce a reduction in accuracy due to imperfect approximation. The network architecture is not changed after quantization and feature maps are compressed only up to a certain suboptimal bitwidth resolution.

Next, nonlinear dimensionality reduction is performed using an additional convolution layer (step S120). Here, the mapping represented in (6) is performed using the projection weights P^(l) represented in (7).

{circumflex over (x)} ^(l)∈

^(C×H×W) →Ŷ ^(l)∈

^({tilde over (C)}×H×W)  (6)

P ^(l)∈

^({tilde over (C)}×C×H) ^(f) ^(×W) ^(f)   (7)

Note that {tilde over (C)} in (6) and (7) denotes output channel dimension, and is less than C. Here, only the compressed feature map Ŷ^(l) needs to be stored in the memory buffer (step S130).

Thereafter, the compressed feature map Ŷ^(l) can be projected back onto the high-dimensional tensor using the weights R^(l) (step S140). Lastly, an inverse transform using an inverse quantization function q⁻¹( ) (step S150) is performed to obtain the feature map X^(l+1), which is an element of a field of real numbers.

Next, the DNN execution method according to this embodiment, which is illustrated in (b) in FIG. 1, will be described. Unlike the conventional method, this method includes a transformation for representing an intermediate feature map using a binary vector. First, this transformation will be described.

First, consider a scalar x derived from feature map X^(l), which is an element of a field of real numbers. Here, conventional quantization can be represented by (8), where a scalar-to-scalar mapping or nonlinear function is expressed as q(x).

x ∈ ℝ 1 × 1  → q ( )  x ^ ∈ 1 × 1 :  min   x - x ^  2 ( 8 )

Note that {circumflex over (x)} is the quantized scalar,

is the GF(2^(B)) finite field for fixed-point representation, and B is the number of bits.

Here, in this embodiment, a new {circumflex over (x)} representation is introduced by a linear binarization function b( ) defined by (9).

x ^ ∈ 1 × 1  → b ( )  x ~ ∈ ℬ B × 1 : x ~ = b ⊗ x ^ ( 9 )

Here, ⊗ is a bitwise AND operation. Additionally, vector b=[2⁰, 2¹, . . . , 2^(B-1)]^(T), and B is finite field GF(2).

An inverse function of the linear binarization function b( ) is expressed as in (10).

x ~ ∈ ℬ B × 1  → b - 1 ( )  x ^ ∈ 1 × 1 : x ^ = b T  x ~ = b T  b ⊗ x ^ = ( 2 B - 1 ) ⊗ x ^ ( 10 )

Equations (9) and (10) show that a scalar over a higher cardinality finite field can be linearly converted to and from a vector over a finite field with two elements.

Hereinafter, a DNN execution method according to this embodiment including compression of a feature map based on these derivations will be described in accordance with (b) in FIG. 1.

The layers before the layer in which the feature map X^(l) is obtained (step S200) are the same as those through step S100 in (a). Accordingly, description and indication in the drawings of steps before step S200 are omitted.

In the next layer, feature maps X^(l), which are activations, are quantized to obtain feature map (step S210). In the next layer, the transformation in (9) is applied to feature map {circumflex over (x)}^(l) (step S215). The result of this transformation, feature map {tilde over (x)}^(l), is represented by (11).

{tilde over (x)} ^(l) ∈B ^(B×C×H×W)  (11)

The feature map {tilde over (x)}^(l) converted to binary representation in such a manner is hereinafter also referred to as a binary intermediate feature map.

For implementation convenience, a bit dimension newly added to (11) can be concatenated along channel dimension resulting in the binary intermediate feature map {tilde over (x)}^(l) shown in (12).

{tilde over (x)} ^(l) ∈B ^(BC×H×W)  (12)

Note that a module of layers in which the processes in steps S210 and S215 are executed is one example of a first transformation module according to this embodiment.

A single nonlinear dimensionality reduction layer using projection weights P^(l) or a sequence of nonlinear dimensionality reduction layers with P_(i) ^(l) projection weights can be applied to this binary intermediate feature map {tilde over (x)}^(l) to obtain a compressed representation of binary intermediate feature map {tilde over (x)}^(l) in binary vectors over finite field GF(2) (hereinafter also referred to as a compressed feature map {tilde over (Y)}^(l)) (step S220).

Only the compressed feature maps {tilde over (Y)}^(l), which are elements of field B, need to be stored in memory during inference (step S230). Non-compressed feature maps can be processed using small buffers, e.g., in a sequential channel-wise fashion, and therefore need not be stored in memory.

Then, in the layer after processing using convolutional layers R_(i) ^(l), a binary intermediate feature map whose above-described compression is undone is reconstructed (step S240). Once the reconstructed binary intermediate feature map is input into the next layer, the binary representation is undone using the inverse function b⁻¹( ) from (10) (step S245) to convert the binary intermediate feature map into an intermediate feature map, which is an element of a field of integer elements, and then an inverse quantization function q⁻¹( ) is applied to further convert the intermediate feature map into a feature map, which is an element of a field of real numbers (S250).

Note that a module of layers in which the processes in steps S245 and S250 are executed is one example of a second transformation module according to this embodiment.

This concludes the description of the DNN execution method according this embodiment. Next, performance evaluations related to memory usage and accuracy under this method will be introduced and compared with those of conventional methods in an implementation example (to be described later).

[DNN Learning Method]

Next, a backpropagation learning method for the deep neural network executed using the method described above will be described. FIG. 2 is a model illustrating a forward pass during inference in the execution method described above. FIG. 3 is a model illustrating a backward pass during backpropagation corresponding to the execution method described above. The inference pass in FIG. 2 corresponds to equation (9), and the inference pass in FIG. 3 corresponds to equation (10).

Newly introduced function b⁻¹( ) in the DNN execution method according to this embodiment can be represented as a gate that makes hard decisions similar to ReLU. The gradient of function b⁻¹( ) can then be calculated using (13).

∇ ^  ∈ ℝ 1 × 1  → b - 1 ( )  ∇ ^ ∈ ℝ B × 1 : ∇ ~ = x ~ > 0 ∇ ( 13 )

Lastly, the gradient of function b( ) is a scaled sum of the gradient vector calculated by (14).

∇ ~  ∈ ℝ B × 1  → b ( )  ∇ ^ ∈ ℝ 1 × 1 : ∇ ^ = T  ∇ ~ = T  x ~ > 0 ∇ =  x ~  0 ∇ ( 14 )

Note that ∥{tilde over (x)}∥₀ in (14) is a gradient scaling factor that represents the number of nonzero elements in {tilde over (x)}. Practically, the scaling factor can be calculated based on statistical information only once and used as a static hyperparameter for gradient normalization.

Since the purpose of the network according to this embodiment is to learn and keep only the smallest {tilde over (Y)}^(l), the choice of P^(l) and R^(l) initialization is important. Therefore, we can initialize these weight tensors by an identity function that maps the non-compressed feature map to a compressed feature map and vice versa to provide a suitable starting point for training. At the same time, other initializations are possible, e.g., noise sampled from some distribution can be added as well.

Implementation Example 1 [Outline]

The binarization and quantization layers described in the embodiment were implemented using SqueezeNet V1.1 and Mobilenet V2 as base floating-point network architectures.

[SqueezeNet V1.1]

In this implementation example, the “fire2/squeeze” and “fire3/squeeze” layers which are the largest of the “squeeze” layers due to high spatial dimensions were compressed. The input to the network has a resolution of 227×227, and the weights are all floating-point.

The quantized and compressed models are retrained for 100,000 iterations with a mini-batch size of 1,024 on the ImageNet (ILSVRC2012) training dataset, and stochastic gradient descent solver with a step-policy learning rate starting from 1e⁻³/10 every 20,000 iterations. Although this large mini-batch size was used by the original model, it helps the quantized and compressed models to estimate gradients as well. The compressed models were derived and retrained iteratively from the 8-bit quantized model. FIG. 4 shows the results of inference accuracies of 50,000 images from an ImageNet validation dataset. The leftmost column indicates model type (fp32: number of single-precision floating points, uint8: 8-bit unsigned integer array, etc.), and the remaining columns indicate, from left to right: weight data size; activation, i.e., feature map size; top-most answer (top-1) accuracy; and top five answer (top-5) accuracy. Values outside the parenthesis indicate accuracies with retraining, and values inside the parenthesis indicate accuracies without retraining.

According to these results, when binary representation conversion is performed and 1×1 convolution kernels are used, compared to when binary representation conversion is not performed, although the number of weights slightly increases, accuracy increases in the respective models (top-1 accuracy: 6-bit=1.0% increase, 4-bit=2.4% increase). When a 3×3 stride 2 convolution kernel was used, an increase of approximately 47% in weight size for the 6-bit model was observed. That allowed for a decrease in the spatial dimension of feature maps by exploiting local spatial quantization redundancies. Then, the size of feature map activations is further reduced by a factor of 4 compared to when there is no conversion into binary representation, while top-1 accuracy dropped by 4.3% and 4.6% for 8-bit and 6-bit models, respectively, compared to fp32.

[MobileNetV2]

The “conv2_1/linear” feature map was compressed. This feature map is nearly three times the size of any other feature map. The same training hyperparameters are used as in the SqueezeNet setup. The number of iterations is 50,000 with proportional change in learning rate policy. ReLU layer was added after“conv2_1/linear” to be compatible with the current implementation of compression method. Hence, “conv2_1/linear” feature map includes signed integers in the original model and unsigned integers in the modified one. Note that batch normalization layers were observed to cause some instability to the training process. Accordingly, normalization and scaling parameters are fixed and merged into weights and biases of convolutional layers. The modified model was then retrained from the original one. FIG. 5 shows a table of MobileNetV2 ImageNet inference accuracy results. The columns correspond to the table in FIG. 4 for the most part. However, the types of models used under the heading “quantized, not converted to binary representation” are models including the signed integers described above (int9: 9-bit signed integer array, etc.).

The quantized models without ReLU after retraining experience −0.3%, −0.3%, and 0.3% top-1 accuracy drops for 9-bit, 7-bit, and 5-bit quantization, respectively, compared to fp32. Note that quantized MobileNetV2 is resilient to smaller bitwidths with only 0.6% degradation for the 5-bit model compared to the 9-bit model. On the other hand, the ReLU quantized model outperforms all other models in the table in terms of accuracy results.

Models represented in binary and using 1×1 convolution kernels experienced approximately the same scores as with conventional methods without binary representation. When 2×2 stride 2 convolution kernels were used, feature maps were compressed by another factor of 2 with around 4.5% accuracy degradation and 5% increase in weight size.

Although not included in the table, a comparison of results from when a 2×2 stride 2 convolution kernel was used and a 3×3 stride 2 convolution kernel was used showed that the former is superior in terms of both accuracy and data size.

Implementation Example 2 [Outline]

In this implementation example, a Pascal VOC dataset was used for object detection, and accuracies were evaluated. More specifically, 4,952 VOC2007 images and a training dataset of 16,551 VOC2007 and VOC2012 images were used. Moreover, an SSD (single shot detector) 512 model was used in execution of the method described in the above embodiment, and SqueezeNet pretrained on ImageNet was used for feature extraction instead of VGG-16. This reduces the number of parameters and overall inference time by a factor of 4 and 3, respectively.

The original VOC images are rescaled to 512×512 resolution. As with the implementation example with ImageNet, several models were generated for comparison: a floating-point model, quantized models, and compressed models. Quantization and compression were applied to the “fire2/squeeze” and “fire3/squeeze” layers which represent, if the fusion technique is applied, more than 80% of the total feature map memory due to their large spatial dimensions. Typically, spatial dimensions decrease quadratically because of max pooling layers compared to linear growth in the depth dimension. The compressed models are derived from the 8-bit quantized model, and both are retrained for 10,000 mini-batch-256 iterations using SGD solver with a step-policy learning rate starting from 1e⁻³/10 every 2,500 iterations.

[Results]

FIG. 6 shows a table of inference accuracy results according to this implementation example. From left to right, the columns indicate: model type; weight size; feature map, i.e., activation size; and mAP (mean average precision).

Among models that are quantized and not converted to binary representation (with retraining), compared to the floating-point model, the 8-bit quantized model decreases accuracy by 0.04%, while 6-bit, 4-bit, and 2-bit models decrease accuracy by approximately 0.5%, 2.2%, and 12.3%, respectively. Values inside parenthesis are reference values for models without retraining.

Among models using a 1×1 convolution kernel that include binary representation conversion, mAP for the 6-bit model is increased by approximately 0.5% and mAP for the 4-bit model is decreased by approximately 0.5%.

A model using a 2×2 convolution kernel with stride 2 performs better than a corresponding 3×3 convolution kernel while requiring less parameter and computations, exhibiting close to 1% higher mAP.

[Memory Usage]

FIG. 7 shows a table summarizing memory usage in the evaluated SSD models. Note that, here, only the largest feature maps that represent more than 80% of total activation memory are considered.

Assuming that the input frame is stored separately, the fusion technique allows for compression of feature maps by a factor of 19.

Fused and quantized 8-bit and 4-bit fixed-point models decrease the size of feature maps by a factor of 4 and 8, respectively.

When the method according to the embodiment described above that includes binary representation conversion (2×2 stride 2 kernel) is applied, this gains another factor of 2 compression compared to the 4-bit model described above with only 1.5% degradation in mAP.

In total, the memory usage required for this feature extractor is reduced by two orders of magnitude.

CONCLUSION

As described above, the DNN execution method according to this disclosure is performed by additionally including inference and learning over GF(2) in a conventional DNN method including fused layer computation and quantization. Such GF(2) binary representation allows for feature map compression in a higher-dimensional space using auto-encoder inspired layers embedded into a DNN. These compression-decompression layers can be implemented using conventional convolution layers with bitwise operations. More precisely, the method according to the present disclosure trades cardinality of the finite field with the dimensionality of the vector space, which makes possible to learn features at the binary level. The compression method for inference according to the present disclosure can be adopted for GPUs, CPUs, or custom accelerators. Alternatively, existing binary neural networks can be extended to achieve higher accuracy for emerging applications such as object detection among others.

Other Embodiments

Hereinbefore, an execution method and a learning method for a DNN according to one or more aspects have been described based on an exemplary embodiment, but the present disclosure is not limited to this exemplary embodiment. As long as they do not depart from the essence of the present disclosure, various modifications to the exemplary embodiment conceived by those skilled in the art may be included as one of these aspects.

Moreover, although the exemplary embodiment in the present disclosure is described based on execution and learning methods for a DNN, the present disclosure can be implemented as execution and learning devices for a DNN including functional elements that execute the processes of each layer. Such devices are each implemented as one or more information processing devices each including, for example, a processor that executes the method and memory for storing the uncompressed feature maps. FIG. 8 is a block diagram illustrating a hardware configuration example of an information processing device according to this embodiment.

As illustrated in FIG. 8, information processing device 100 includes a CPU (central processing unit) 101, main memory 102, storage 103, a communications I/F (interface) 104, and a GPU (graphics processing unit) 105. These elements are connected via a bus, and are capable of sending and receiving data to and from one another.

CPU 101 is a processor that executes a control program stored in, for example, storage 103, and a program for, for example, implementing the DNN execution method described above.

Main memory 102 is a volatile storage area used by CPU 101 as a work area for executing the programs.

Storage 103 is a non-volatile storage area that stores, for example, the programs.

Communications I/F 104 is a communications interface that communicates with external devices via a communications network (not shown in the drawings). For example, when the DNN execution device is implemented as a plurality of information processing devices 100, the sending and receiving of data between information processing devices 100 is performed by communications I/F 104 via the communications network. Communications I/F 104 is, for example, a wired LAN interface. Note that the communications I/F 104 may be a wireless LAN interface. Moreover, the communications I/F 104 is not limited to a LAN interface; communications I/F 104 may be any sort of communications interface that is capable of communicatively connecting to a communications network.

GPU 105 is, for example, a processor that executes a program for implementing the DNN learning method described above.

The present disclosure can also be implemented as a program for causing an information processing device including a processor and memory to execute the DNN execution or learning method according to the embodiment, and as a non-transitory recording medium having such a program recorded thereon.

INDUSTRIAL APPLICABILITY

The present disclosure is applicable in computer vision applications such as image classification and object detection. 

1. An execution method for a deep neural network, the execution method comprising: obtaining, during deep neural network inference, a binary intermediate feature map in binary representation by converting a floating-point or fixed-point intermediate feature map into a binary vector using a first transformation module; generating a compressed feature map by compressing the binary intermediate feature map using a nonlinear dimensionality reduction layer; storing the compressed feature map into memory; reconstructing the binary intermediate feature map by decompressing the compressed feature map read from the memory using a reconstruction layer corresponding to the nonlinear dimensionality reduction layer; and converting the reconstructed binary intermediate feature map into a floating-point or fixed-point intermediate feature map using a second transformation module.
 2. The execution method according to claim 1, wherein the nonlinear dimensionality reduction layer is a single projection convolved layer or a sequence of projection convolved layers, and the reconstruction layer is a single reconstruction convolved layer or a sequence of reconstruction convolved layers.
 3. A backpropagation-based learning method for the deep neural network executed using the execution method according to claim 1, the learning method comprising: applying an analytical derivative of the first transformation module and the second transformation module to a gradient for a next layer among layers included in the deep neural network to generate a gradient for a previous layer among the layers included in the deep neural network; updating a weight and a bias based on the gradient generated for the previous layer; and initializing a weight for the nonlinear dimensionality reduction layer and a weight for the reconstruction layer, based on an identity mapping function.
 4. An execution device for a deep neural network, the execution device comprising: a processor that executes deep neural network inference, wherein the processor: obtains a binary intermediate feature map in binary representation by converting a floating-point or fixed-point intermediate feature map into a binary vector using a first transformation module; generates a compressed feature map by compressing the binary intermediate feature map using a nonlinear dimensionality reduction layer; stores the compressed feature map into memory; reconstructs the binary intermediate feature map by decompressing the compressed feature map read from the memory using a reconstruction layer corresponding to the nonlinear dimensionality reduction layer; and converts the reconstructed binary intermediate feature map into a floating-point or fixed-point intermediate feature map using a second transformation module.
 5. A learning device for a deep neural network, the learning device comprising: a processor that executes backpropagation-based learning by the deep neural network executed using the execution method according to claim 1, wherein the processor: applies an analytical derivative of the first transformation module and the second transformation module to a gradient for a next layer among layers included in the deep neural network to generate a gradient for a previous layer among the layers included in the deep neural network; updates a weight and a bias based on the gradient generated for the previous layer; and initializes a weight for the nonlinear dimensionality reduction layer and a weight for the reconstruction layer, based on an identity mapping function.
 6. A non-transitory computer-readable recording medium for use in a computer, the recoding medium having a computer program recorded thereon for causing the computer to execute the execution method according to claim
 1. 7. A non-transitory computer-readable recording medium for use in a computer, the recoding medium having a computer program recorded thereon for causing the computer to execute the learning method according to claim
 3. 